On DP-coloring of digraphs

DP-coloring is a relatively new coloring concept by Dvořák and Postle and was introduced as an extension of list-colorings of (undirected) graphs. It transforms the problem of finding a list-coloring of a given graph $G$ with a list-assignment $L$ to finding an independent transversal in an auxiliary graph with vertex set $\text{◂{}▸}\{\left(v,c\right)|\text{◂+▸}v\in V\left(G\right),\text{◂+▸}c\in L\left(v\right)\}$. In this paper, we extend the definition of DP-colorings to digraphs using the approach from Neumann-Lara where a coloring of a digraph is a coloring of the vertices such that the digraph does not contain any monochromatic directed cycle. Furthermore, we prove a Brooks’ type theorem regarding the DP-chromatic number, which extends various results on the (list-)chromatic number of digraphs.     

Brownian motion and thermophoresis effects on unsteady stagnation point flow of Eyring-Powell nanofluid: a Galerkin approach

This article concerns the analysis of an unsteady stagnation point flow of Eyring-Powell nanofluid over a stretching sheet. The influence of thermophoresis and Brownian motion is also considered in transport equations. The nonlinear ODE set is obtained from the governing nonlinear equations via suitable transformations. The numerical experiments are performed using the Galerkin scheme. A tabular form comparison analysis of outcomes attained via the Galerkin approach and numerical scheme (RK-4) is available to show the credibility of the Galerkin method. The numerical exploration is carried out for various governing parameters, namely, Brownian motion, steadiness, thermophoresis, stretching ratio, velocity slip, concentration slip, thermal slip, and fluid parameters, and Hartmann, Prandtl and Schmidt numbers. The velocity of fluid enhances with an increase in fluid and magnetic parameters for the case of opposing, but the behavior is reversed for assisting cases. The Brownian motion and thermophoresis parameters cause an increase in temperature for both cases (assisting and opposing). The Brownian motion parameter provides a drop-in concentration while an increase is noticed for the thermophoresis parameter. All the outcomes and the behavior of emerging parameters are illustrated graphically. The comparison analysis and graphical plots endorse the appropriateness of the Galerkin method. It is concluded that said method could be extended to other problems of a complex nature.     

基于机器视觉的刀具轮廓在线检测方法的研究

超精密单点金刚石车削过程中需要对刀具参数进行检测。基于机器视觉原理,采用新型的机械结构设计了新型刀具在线检测系统。通过垂直放置的两组由同轴远心镜头和CMOS相机组成的光学系统来获取车刀刀尖正面及侧面的图像,再经图像处理系统来获取刀具的轮廓及位置信息,完成对刀具轮廓及位置的在线检测,实验验证可实现测量的重复性定位精度达1μm。在线检测的方式借助了超精密车床自身的高精度和运动机构,可以保证相机焦点和机床主轴之间的相对位置关系,弥补了目前刀具检测系统稳定性差和重复性精度低的不足,提高了加工的整体效率。     

分数阶Schrodinger—Kirchhoff方程无穷多高能量解的存在性

本文研究如下带有变号势函数的分数阶Schrodinger Kirchhoff方程(a+b∫∫R^N|u(x)-u(y)|^p/|x-y|^N+p^sdxdy)^p-1(-△)p^su+λV(x)|u|^p-2u=f(x,u)-μg(x)|u|^q-2u,x∈R^N.其中s∈(0,1),p∈[2,∞),q∈(l,p),a,b>0,λ,μ>0均为正常数,在V,f,g等函数合适的条件下,运用喷泉定理获得该系统无穷多高能量解的存在性.     

基于迁移学习的原子力显微镜成像恢复方法

受限于探针针尖结构尺寸,用原子力显微镜进行微纳测量时会产生图像边缘失真.提出了一种基于迁移学习的原子力显微镜成像恢复方法,通过迁移学习训练源模型和靶模型实现一维栅格成像恢复.该方法采用数学形态法中的腐蚀算法生成栅格点云数据,通过U-Net网络源模型从点云中提取针尖卷积效应的特征向量,将权重参数迁移至U-Net网络靶模型,靶模型在自适应正则化方法下进行监督学习.实验结果表明,该方法能有效恢复一维栅格的原子力显微镜测量图像,提高横向分辨力,可用于纳米栅格的线宽检测上.     

激光雷达辅助驾驶道路参数计算方法研究

针对特定场景辅助驾驶的需求，构建道路场景车载激光雷达三维扫描系统，并设计基于三维激光点云的道路参数提取与计算方法，包括路面宽度、横杆或桥梁或隧道限高、拐弯半径等等，为辅助判断道路的可通过性提供决策依据。测试和对比实验表明，所设计算法效果稳定、精度良好，在效率和自动化程度上有一定优势，可为辅助驾驶提供非常有益的决策参数。     

Probabilities of incidence between lines and a plane curve over finite fields

We study the probability for a random line to intersect a given plane curve, over a finite field, in a given number of points over the same field. In particular, we focus on the limits of these probabilities under successive finite field extensions. Supposing absolute irreducibility for the curve, we show how a variant of the Chebotarev density theorem for function fields can be used to prove the existence of these limits, and to compute them under a mildly stronger condition, known as simple tangency. Partial results have already appeared in the literature, and we propose this work as an introduction to the use of the Chebotarev theorem in the context of incidence geometry. Finally, Veronese maps allow us to compute similar probabilities of intersection between a given curve and random curves of given degree.